A global minimization algorithm for Tikhonov functionals with sparsity constraints
نویسندگان
چکیده
منابع مشابه
A Semismooth Newton Method for Tikhonov Functionals with Sparsity Constraints
Minimization problems in l for Tikhonov functionals with sparsity constraints are considered. Sparsity of the solution is ensured by a weighted l penalty term. The necessary and sufficient condition for optimality is shown to be slantly differentiable (Newton differentiable), hence a semismooth Newton method is applicable. Local superlinear convergence of this method is proved. Numerical exampl...
متن کاملMinimization of Tikhonov Functionals in Banach Spaces
Tikhonov functionals are known to be well suited for obtaining regularized solutions of linear operator equations. We analyze two iterative methods for finding the minimizer of norm-based Tikhonov functionals in Banach spaces. One is the steepest descent method, whereby the iterations are directly carried out in the underlying space, and the other one performs iterations in the dual space. We p...
متن کاملIterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of `p-penalties is proposed. In contrast to the well-known algorithm considered by Daubechies, Defrise and De Mol, it uses hard instead of soft shrinkage. It is shown that the hard shrinkage algorithm is a special case of the generalized conditiona...
متن کاملA Tikhonov-based projection iteration for nonlinear Ill-posed problems with sparsity constraints
In this paper, we consider nonlinear inverse problems where the solution is assumed to have a sparse expansion with respect to a preassigned basis or frame. We develop a scheme which allows to minimize a Tikhonov functional where the usual quadratic regularization term is replaced by a one–homogeneous (typically weighted `p) penalty on the coefficients (or isometrically transformed coefficients...
متن کاملConvergence rates and source conditions for Tikhonov regularization with sparsity constraints
This paper addresses the regularization by sparsity constraints by means of weighted lp penalties for 0 ≤ p ≤ 2. For 1 ≤ p ≤ 2 special attention is payed to convergence rates in norm and to source conditions. As main results it is proven that one gets a convergence rate of √ δ in the 2-norm for 1 < p ≤ 2 and in the 1-norm for p = 1 as soon as the unknown solution is sparse. The case p = 1 needs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis
سال: 2014
ISSN: 0003-6811,1563-504X
DOI: 10.1080/00036811.2014.931025